Lindström Quantifiers and Leaf Language Definability
نویسندگان
چکیده
We show that examinations of the expressive power of logical formulae enriched by Lindström quantifiers over ordered finite structures have a well-studied complexity-theoretic counterpart: the leaf language approach to define complexity classes. Model classes of formulae with Lindström quantifiers are nothing else than leaf language definable sets. Along the way we tighten the best up to now known leaf language characterization of the classes of the polynomial time hierarchy and give a new model-theoretic characterization of .
منابع مشابه
A Generalized Quantifier Concept in Computational Complexity Theory
A notion of generalized quantifier in computational complexity theory is explored and used to give a unified treatment of leaf language definability, oracle separations, type 2 operators, and circuits with monoidal gates. Relations to Lindström quantifiers are pointed out.
متن کاملRegular languages definable by Lindström quantifiers
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
متن کاملOn the Expressive Power of Monotone Natural Language Quantifiers over Finite Models
We study definability in terms of monotone generalized quantifiers satisfying Isomorphism closure, Conservativity and Extension. Among the quantifiers with the latter three properties — here called CE quantifiers — one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number ...
متن کاملCharacterizing Definability of Second-Order Generalized Quantifiers
We study definability of second-order generalized quantifiers. We show that the question whether a second-order generalized quantifier Q1 is definable in terms of another quantifier Q2, the base logic being monadic second-order logic, reduces to the question if a quantifier Q1 is definable in FO(Q2, <,+,×) for certain first-order quantifiers Q1 and Q2. We use our characterization to show new de...
متن کاملGeneralized Quantifiers in Dependence Logic
We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics using the Hodges semantics, e.g., IF-logic and dependence logic. For this we introduce the multivalued dependence atom and observe the similarities with the, by Väänänen and Grädel, newly introduced independence atom.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 9 شماره
صفحات -
تاریخ انتشار 1996